Apresenta o Programa de Formação Interdisciplinar Superior (ProFIS), curso de nível superior implantado na Universidade Estadual de Campinas (Unicamp) em 2011. Primeiramente, são citados os objetivos e as diretrizes que nortearam a criação do curso - aumento do ingresso de alunos de escolas públicas na universidade e a adoção de um programa de formação geral - e, em seguida, descritos, em linhas gerais, o novo curso, seu currículo e o processo de transferência dos alunos concluintes do ProFIS para os cursos de graduação da Unicamp. Conclui apresentando uma análise sobre o critério de seleção adotado, bem como alguns dados estatísticos que revelam que os propósitos de inclusão social foram plenamente alcançados pela primeira turma matriculada no programa.

This paper introduces the ProFIS (a portuguese acronym for Interdisciplinary Higher Education Program), an undergraduate course established at Universidade Estadual de Campinas (Unicamp) in 2011. Firstly, we mention the guidelines adopted for the creation of the course, which are the increase of the admission of low-income students, and the adoption of a general education program at the university. Then, we briefly describe the new course, including its curriculum and the mechanism of migration from ProFIS to other undergraduate courses of Unicamp. We conclude presenting the admission process, as well as some statistical data that reveals that the social inclusion aim was fully achieved by the first group of students admitted to the program.

We introduce a globally convergent sequential linear programming method for nonlinear programming. The algorithm is applied to the solution of classic topology optimization problems, as well as to the design of compliantmechanisms. The numerical results suggest that the new algorithm is faster than the globally convergent version of the method of moving asymptotes, a popular method for mechanical engineering applications proposed by Svanberg.

We formulate a truss topology optimization problem as a bilevel programming problem and solve it by means of a line search type inexact restoration algorithm. We discuss details of the implementation and show results of numerical experiments.